Tridiagonalizing Complex Symmetric Matrices in Waveguide Simulations

نویسندگان

  • Wilfried N. Gansterer
  • Hannes Schabauer
  • Christoph Pacher
  • N. Finger
چکیده

We discuss a method for solving complex symmetric (nonHermitian) eigenproblems Ax = λBx arising in an application from optoelectronics, where reduced accuracy requirements provide an opportunity for trading accuracy for performance. In this case, the objective is to exploit the structural symmetry. Consequently, our focus is on a nonHermitian tridiagonalization process. For solving the resulting complex symmetric tridiagonal problem, a variant of the Lanczos algorithm is used. Based on Fortran implementations of these algorithms, we provide extensive experimental evaluations. Runtimes and numerical accuracy are compared to the standard routine for non-Hermitian eigenproblems, LAPACK/zgeev. Although the performance results reveal that more work is needed in terms of increasing the fraction of Level 3 Blas in our tridiagonalization routine, the numerical accuracy achieved with the nonHermitian tridiagonalization process is very encouraging and indicates important research directions for this class of eigenproblems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block Lanczos Tridiagonalization of Complex Symmetric Matrices

The classic Lanczos method is an effective method for tridiagonalizing real symmetric matrices. Its block algorithm can significantly improve performance by exploiting memory hierarchies. In this paper, we present a block Lanczos method for tridiagonalizing complex symmetric matrices. Also, we propose a novel componentwise technique for detecting the loss of orthogonality to stablize the block ...

متن کامل

The (R,S)-symmetric and (R,S)-skew symmetric solutions of the pair of matrix equations A1XB1 = C1 and A2XB2 = C2

Let $Rin textbf{C}^{mtimes m}$ and $Sin textbf{C}^{ntimes n}$ be nontrivial involution matrices; i.e., $R=R^{-1}neq pm~I$ and $S=S^{-1}neq pm~I$. An $mtimes n$ complex matrix $A$ is said to be an $(R, S)$-symmetric ($(R, S)$-skew symmetric) matrix if $RAS =A$ ($ RAS =-A$). The $(R, S)$-symmetric and $(R, S)$-skew symmetric matrices have a number of special properties and widely used in eng...

متن کامل

On Tridiagonalizing and Diagonalizing Symmetric Matrices with Repeated Eigenvalues

We describe a divide-and-conquer tridiagonalizationapproach for matrices with repeated eigenvalues. Our algorithmhinges on the fact that, under easily constructivelyveriiable conditions,a symmetricmatrix with bandwidth b and k distinct eigenvalues must be block diagonal with diagonal blocks of size at most bk. A slight modiication of the usual orthogonal band-reduction algorithm allows us to re...

متن کامل

Communication Avoiding Symmetric Band Reduction

The running time of an algorithm depends on both arithmetic and communication (i.e., data movement) costs, and the relative costs of communication are growing over time. In this work, we present both theoretical and practical results for tridiagonalizing a symmetric band matrix: we present an algorithm that asymptotically reduces communication, and we show that it indeed performs well in practi...

متن کامل

Properties of Central Symmetric X-Form Matrices

In this paper we introduce a special form of symmetric matrices that is called central symmetric $X$-form matrix and study some properties, the inverse eigenvalue problem and inverse singular value problem for these matrices.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008